A fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinates
نویسندگان
چکیده
A new fast addition algorithm on an elliptic curve over GF(2n) using the projective coordinates with x =X/Z and y = Y/Z2 is proposed. 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Efficient Unified Montgomery Inversion with Multibit Shifting
Computation of multiplicative inverses in finite fields GF (p) and GF (2) is the most time consuming operation in elliptic curve cryptography especially when affine coordinates are used. Since the existing algorithms based on extended Euclidean algorithm do not permit a fast software implementation, projective coordinates, which eliminate almost all of the inversion operations from the curve ar...
متن کاملApplying Hessian Curves in Parallel to improve Elliptic Curve Scalar Multiplication Hardware
As a public key cryptography, Elliptic Curve Cryptography (ECC) is well known to be the most secure algorithms that can be used to protect information during the transmission. ECC in its arithmetic computations suffers from modular inversion operation. Modular Inversion is a main arithmetic and very long-time operation that performed by the ECC crypto-processor. The use of projective coordinate...
متن کاملA Low-Cost ECC Coprocessor for Smartcards
In this article we present a low-cost coprocessor for smartcards which supports all necessary mathematical operations for a fast calculation of the Elliptic Curve Digital Signature Algorithm (ECDSA) based on the finite field GF(2m). These ECDSA operations are GF(2m) addition, 4-bit digit-serial multiplication in GF(2m), inversion in GF(2m), and inversion in GF(p). An efficient implementation of...
متن کاملFast Implementation of Elliptic Curve Arithmetic in GF(pn)
Elliptic curve cryptosystems have attracted much attention in recent years and one of major interests in ECC is to develop fast algorithms for elliptic curve arithmetic. In this paper we present various improvement techniques for eld arithmetic in GF(p n)(p a prime), in particular , fast eld multiplication and inversion algorithms, and provide our implementation results on Pentium II and Alpha ...
متن کاملHardware Implementation of an Elliptic Curve Processor over GF(p)
This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography (PKC), i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multiplication in a systolic array architecture is used for modular multiplication. The processor consists of special operational blocks for Montgom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 76 شماره
صفحات -
تاریخ انتشار 2000